#define _CRT_SECURE_NO_WARNINGS 1
#include"Queue.h"
#include"BT.h"
void testFunc()
{

	BTNode* n1 = BuyNode(1);
	BTNode* n2 = BuyNode(2);
	BTNode* n3 = BuyNode(3);
	BTNode* n4 = BuyNode(4);
	BTNode* n5 = BuyNode(5);
	BTNode* n6 = BuyNode(6);
	BTNode* n7 = BuyNode(7);

	n1->_left = n2;
	n2->_left = n3;
	n1->_right = n4;
	n4->_left = n5;
	//n4->_right = n6;
	//printf("%d\n",BinaryTreeSize(n1));
	//BinaryTreePrevOrder(n1);//1 2 3 NULL NULL NULL 4 5 NULL NULL 6 NULL NULL
	n4->_right = n6;
	n6->_left = n7;
	printf("%d\n", BinaryTreeSize(n1));
	printf("%d\n", BinaryTreeLeafSize(n1));
	//BinaryTreeInOrder(n1);
	printf("%d \n", BinaryTreeLevelKSize(n1,3));

	//BinaryTreePostOrder(n1);
	printf("%d",TreeHight(n1));

	BinaryTreeLevelOrder(n1);

}

int main()
{
	testFunc();
	return 0;
}